School of Computer Science Literature Review and Survey (0360-510, Fall 2006) Heuristics for Traffic Grooming in WDM Optical Networks with Shared Path Protection

نویسندگان

  • Richard Frost
  • Quazi Rahman
چکیده

The emergence of wavelength division multiplexing (WDM) technology has significantly increased the transmission capacity of a link in today's optical networks. In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity optical fibers to make an efficient use of the bandwidth and, also to increase the network throughput. In addition, since huge amount data can flow at a very high speed in a WDM optical network, survivability of such a network against any fault, especially, in the optical fiber link, is of prime concern. Survivable traffic grooming in WDM optical networks has become a topic that is gaining more and more research and commercial attention. In this paper we present a survey of recent research on traffic grooming in WDM optical networks. We have tried to review the research papers that are focused on survivable traffic grooming in WDM mesh networks with an emphasis on shared-path protection, which uses less network resources than dedicated-path protection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

Availability-Guaranteed Service Provisioning Employing a Generalized Path-Protection Model in WDM Networks

Traffic grooming deals with efficiently packing/unpacking low-speed connections onto high-capacity trunks. We examine traffic grooming for optical mesh networks by reviewing grooming-node architectures, traffic models, grooming policies, novel graph models, survivable grooming, and hierarchical switching, etc. @2003 Optical Society of America OCIS codes: (060.4250) Networks; (060.4510) Optical ...

متن کامل

A Review of Optical Routers in Photonic Networks-on-Chip: A Literature Survey

Due to the increasing growth of processing cores in complex computational systems, all the connection converted bottleneck for all systems. With the protection of progressing and constructing complex photonic connection on chip, optical data transmission is the best choice for replacing with electrical interconnection for the reason of gathering connection with a high bandwidth and insertion lo...

متن کامل

Traffic Grooming in Wdm Networks with Path Protection

For the next generation optical internet to meet the growing traffic needs WDM technology is the key issue to realize high capacity networking infrastructure. In this paper an efficient algorithm is implemented for circuit switching in wide area networks. This algorithm known as semelightpath algorithm has been applied to ARPANET and NSFNET to estimate the blocking probability of a call via ful...

متن کامل

Metaheuristic Approaches to Traffic Grooming in Wdm Optical Networks

The widespread deployment of WDM optical networks posts lots of new challenges for network designers. Traffic grooming is one of the most common problems. Efficient grooming of traffic can effectively reduce the overall cost of the network. But unfortunately, traffic grooming problems have been shown to be NP-hard. Therefore, new heuristics must be devised to tackle them. Among these approaches...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007